Classification of irreducible factorable polynomials over a finite field
نویسندگان
چکیده
منابع مشابه
Irreducible Polynomials over Finite Fields
As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...
متن کاملEnumerating all the Irreducible Polynomials over Finite Field
In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree n over a finite field and their roots in the extension field in quasilinear∗ time cost per element. Our algorithm is based on an improved algorithm for enumerating all the Lyndon words of length n in linear delay time and the known reduction of Lynd...
متن کاملConstruction of Irreducible Polynomials over Finite Fields
In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in de...
متن کاملConstructing irreducible polynomials over finite fields
We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev’s density theorem.
متن کاملGenerators and irreducible polynomials over finite fields
Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1967
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-12-3-301-313